Alternating Evolution Schemes for Hamilton-Jacobi Equations

نویسندگان

  • Hailiang Liu
  • Michael Pollack
  • Haseena Saran
چکیده

In this work, we propose a high-resolution alternating evolution (AE) scheme to solve Hamilton–Jacobi equations. The construction of the AE scheme is based on an alternating evolution system of the Hamilton–Jacobi equation, following the idea previously developed for hyperbolic conservation laws. A semidiscrete scheme derives directly from a sampling of this system on alternating grids. Higher order accuracy is achieved by a combination of high order nonoscillatory polynomial reconstruction from the obtained grid values and a time discretization with matching accuracy. Local AE schemes are made possible by choosing the scale parameter to reflect the local distribution of waves. The AE schemes have the advantage of easy formulation and implementation and efficient computation of the solution. For the first local AE scheme and the second order local AE scheme with a limiter, we prove the numerical stability in the sense of satisfying the maximum principle. Numerical experiments for a set of Hamilton–Jacobi equations are presented to demonstrate both accuracy and capacity of these AE schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating evolution discontinuous Galerkin methods for Hamilton-Jacobi equations

In this work, we propose a high resolution Alternating Evolution Discontinuous Galerkin (AEDG) method to solve Hamilton-Jacobi equations. The construction of the AEDG method is based on an alternating evolution system of the Hamilton-Jacobi equation, following the previous work [H. Liu, M. Pollack and H. Saran, SIAM J. Sci. Comput. 35(1), (2013) 122–149] on AE schemes for Hamilton-Jacobi equati...

متن کامل

High Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations

We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...

متن کامل

Error Bounds for Monotone Approximation Schemes for Hamilton-Jacobi-Bellman Equations

We obtain error bounds for monotone approximation schemes of Hamilton-Jacobi-Bellman equations. These bounds improve previous results of Krylov and the authors. The key step in the proof of these new estimates is the introduction of a switching system which allows the construction of approximate, (almost) smooth supersolutions for the Hamilton-Jacobi-Bellman equation.

متن کامل

Finite difference Hermite WENO schemes for the Hamilton-Jacobi equations

In this paper, a new type of finite difference Hermite weighted essentially non-oscillatory (HWENO) schemes are constructed for solving Hamilton-Jacobi (HJ) equations. Point values of both the solution and its first derivatives are used in the HWENO reconstruction and evolved via time advancing. While the evolution of the solution is still through the classical numerical fluxes to ensure conver...

متن کامل

Central Schemes for Multidimensional Hamilton-Jacobi Equations

We present new, efficient central schemes for multi-dimensional HamiltonJacobi equations. These non-oscillatory, non-staggered schemes are firstand second-order accurate and are designed to scale well with an increasing dimension. Efficiency is obtained by carefully choosing the location of the evolution points and by using a one-dimensional projection step. Firstand second-order accuracy is ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2013